ECOLOGICAL TENSION: BETWEEN MINIMUM AND MAXIMUM CHANGES
نویسندگان
چکیده
منابع مشابه
study of annual maximum and minimum temperatures changes in iran
in this investigation, using mann â kendall graphical-statistical test, which is one of the proposed methods of world meteorological organization (wmo) for time series analysis, the change trend of long â term mean of annual minimum and maximum temperatures in iran will be studied. to evaluate this trend and access a suitable pattern in this situation, average of annual minimum and maximum ...
متن کاملMaximum Load and Minimum Volume Structural Optimization
A bi-criteria optimization is considered whose objectives are the maximization of the load sustained by a structure and the minimization of the structure's volume. As the objectives are conflicting, the solution to the problem is of the Pareto type. The problem is elaborated for a thin-walled column of cruciform cross-section, prone to flexural and torsional buckling. A numerical example is als...
متن کاملTricyclic and Tetracyclic Graphs with Maximum and Minimum Eccentric Connectivity
Let $G$ be a connected graph on $n$ vertices. $G$ is called tricyclic if it has $n + 2$ edges, and tetracyclic if $G$ has exactly $n + 3$ edges. Suppose $mathcal{C}_n$ and $mathcal{D}_n$ denote the set of all tricyclic and tetracyclic $n-$vertex graphs, respectively. The aim of this paper is to calculate the minimum and maximum of eccentric connectivity index in $mathcal{C}_n$ and $mathcal{D}_n...
متن کاملEcological Studies in the Tension Zone between Prairie and Woodland
Upon the completion of a series of investigations in southeastern Washington and adjacent Idaho (23), in which there was found to be a direct relation between the available water content of the soil and the evaporating power of the air as succession progressed from gl'assland through scrub to forest, the senior writer moved to Minneapolis, Minnesota. Here such excellent conditions of prairie in...
متن کاملMaximum Clique and Minimum
In an alternative approach to \characterizing" the graph class of visibility graphs of simple polygons, we study the problem of nding a maximum clique in the visibility graph of a simple polygon with n vertices. We show that this problem is very hard, if the input polygons are allowed to contain holes: a gap-preserving reduction from the maximum clique problem on general graphs implies that no ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Comparative Philosophy: An International Journal of Constructive Engagement of Distinct Approaches toward World Philosophy
سال: 2014
ISSN: 2151-6014
DOI: 10.31979/2151-6014(2014).050207